Access Control to Two Multiserver Loss Queues in Series
نویسندگان
چکیده
We consider admission policies to two multiserver loss queues in series with two types of traffic. Both are generated according to independent Poisson processes with constant arrival rates. The first type requires service at the first queue and with a positive probability enters the second queue; the second type requires service at only the second queue. The service time distribution is exponential at either station. We show that under appropriate conditions the optimal admission policy that maximizes the expected total discounted reward over an infinite horizon is given by a switching curve. We characterize the form and shape of this curve and its variation with system parameters.
منابع مشابه
Access control of parallel multiserver loss queues
This paper considers access control in a target multiserver loss queue fed by a set of upstream parallel multiserver loss queues and by a stream of new customers. The target queue faces a choice of how many servers to reserve for each stream. Revenue is gained by each station when it serves a customer, but the amount of revenue at the target queue depends on the source of the customer. We prove...
متن کاملQ Q Ueuing Ueuing a Analysis Nalysis
WHY QUEUING ANALYSIS? ......................................................................................2 QUEUING MODELS......................................................................................................3 The Single-Server Queue.....................................................................................3 Queue Parameters .............................................
متن کاملA Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملFurther delay moment results for FIFO multiserver queues
Using a new family of service disciplines, we provide weaker su cient conditions for nite stationary delay moments in FIFO multiserver queues. This extends the work in Sigman and Scheller-Wolf[1997] to GI=GI=s queues with = E[S]=E[T ] < s 1, where S and T are generic service and interarrival times, respectively. Thus, only when > s 1 are the familiar Kie er and Wolfowitz conditions actually nec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998